Optimal Checkpoint Placement for Real-Time Systems with Multi-Tasks Having Deadlines Longer Than Periods
نویسندگان
چکیده
منابع مشابه
Deadlines in Real-Time Systems
This paper discusses the timeliness of real-time control services as seen by the control engineering and real-time scientific communities, arguing that computer-controllers must be designed to meet performance deadlines that, under special circumstances, can be missed as long as hard deadlines are still met. Hard and performance deadlines are central to the design of fault-tolerant real-time sy...
متن کاملMalmquist Productivity Index for Multi Time Periods
The performance of a decision making unit (DMU) can be evaluated in either across-sectional or a time-series manner, and data envelopment analysis (DEA) is a useful method for both types of evaluation. The Malmquist productivity index (MPI) evaluates the change in efficiency of a DMU between two time periods. It is defined as the product of the Catch-up and Frontier-shift terms. In this pape...
متن کاملScheduling with message deadlines for hard real time SDL systems
Hard real–time system design requires both, a methodology that allows to control the increasing functional complexity and additionally an a–priori proof that all timing requirements will be met even in worst case situations. This work introduces a design heuristics based on the formal " Specification and Description Language " SDL aiming on the integration of a timeliness verification into an a...
متن کاملScheduling Real-Time Dwells Using Tasks with Synthetic Periods
This paper addresses the problem of scheduling realtime dwells in multi-function phase array radar systems. To keep track of targets, a radar system must meet its timing and energy constraints. We propose a new task model for radar dwells to accurately characterize their timing parameters. We develop an algorithm of transforming every dwell task as a semi-period task so the dwell task can meet ...
متن کاملAlgorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real-time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing times of its mandatory and optional parts may become larger. The composite tasks are scheduled by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Transactions of The Korean Institute of Electrical Engineers
سال: 2012
ISSN: 1975-8359
DOI: 10.5370/kiee.2012.61.1.148